Program Structures: Some New Characterisations
نویسندگان
چکیده
منابع مشابه
Developing numerical algorithm and a new program for simulating alkali aggregate reaction in mass concrete
Nowadays, Alkali Aggregate Reaction is considered as one of the most dangerous weak points of concrete and its occurrence has been widely reported in various structures. In the current study, a program is developed for predicting and examining the effects of mentioned reaction on the three-dimensional analysis of concrete structures such as arch dams. In this regard, a program provided for dam ...
متن کاملOptimization and Majorization of Invariant Measures
The set of ×2-invariant measures can be equipped with the partial order of majorization, describing relative dispersion. The minimal elements for this order are precisely the Sturmian measures of Morse and Hedlund. This yields new characterisations of Sturmian measures, and has applications to the ergodic optimization of convex functions.
متن کاملProcess and truth-table characterisations of randomness
This paper uses quick process machines to provide characterisations of computable randomness, Schnorr randomness and weak randomness. The quick process machine is a type of process machine first considered in work of Levin and Zvonkin. A new technique for building process machines and quick process machines is presented. This technique is similar to the KC theorem for prefix-free machines. Usin...
متن کاملClosure Operators for ROBDDs
Program analysis commonly makes use of Boolean functions to express information about run-time states. Many important classes of Boolean functions used this way, such as the monotone functions and the Boolean Horn functions, have simple semantic characterisations. They also have well-known syntactic characterisations in terms of Boolean formulae, say, in conjunctive normal form. Here we are con...
متن کاملWhen Is a Type Refinement an Inductive Type?
Dependently typed programming languages allow sophisticated properties of data to be expressed within the type system. Of par-ticular use in dependently typed programming are indexed types that refine data by computationally useful information. For example, the Nindexed type of vectors refines lists by their lengths. Other data types may be refined in similar ways, but programmers must produce ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comput. Syst. Sci.
دوره 43 شماره
صفحات -
تاریخ انتشار 1991